Solution of indefinite linear systems using an LQ decomposition for the linear constraints
نویسنده
چکیده
In this paper, indefinite linear systems with linear constraints are considered. We present a special decomposition that makes use of the LQ decomposition, and retains the constraints in the factors. The resulting decomposition is of a structure similar to that obtained using the Bunch-Kaufman-Parlett algorithm. The decomposition can be used in a direct solution algorithm for indefinite systems, but it can also be used to construct effective preconditioners. Combinations of the latter with conjugate gradient type methods have been demonstrated to be very useful.
منابع مشابه
Indefinite Stochastic Linear Quadratic Control and Generalized Differential Riccati
A stochastic linear quadratic (LQ) control problem is indefinite when the cost weighting matrices for the state and the control are allowed to be indefinite. Indefinite stochastic LQ theory has been extensively developed and has found interesting applications in finance. However, there remains an outstanding open problem, which is to identify an appropriate Riccati-type equation whose solvabili...
متن کاملSsT decomposition method for solving fully fuzzy linear systems
The SST decomposition method for solving system of linear equations make it possible to obtain the values of roots of the system with the specified accuracy as the limit of the sequence of some vectors. In this topic we are going to consider vectors as fuzzy vectors. We have considered a numerical example and tried to find out solution vector x in fuzzified form using method of SST decomposition.
متن کاملNumerical solution of the one dimensional non-linear Burgers equation using the Adomian decomposition method and the comparison between the modified Local Crank-Nicolson method and the VIM exact solution
The Burgers’ equation is a simplified form of the Navier-Stokes equations that very well represents their non-linear features. In this paper, numerical methods of the Adomian decomposition and the Modified Crank – Nicholson, used for solving the one-dimensional Burgers’ equation, have been compared. These numerical methods have also been compared with the analytical method. In contrast to...
متن کاملFUZZY LINEAR PROGRAMMING WITH GRADES OF SATISFACTION IN CONSTRAINTS
We present a new model and a new approach for solving fuzzylinear programming (FLP) problems with various utilities for the satisfactionof the fuzzy constraints. The model, constructed as a multi-objective linearprogramming problem, provides flexibility for the decision maker (DM), andallows for the assignment of distinct weights to the constraints and the objectivefunction. The desired solutio...
متن کاملLinear plus fractional multiobjective programming problem with homogeneous constraints using fuzzy approach
We develop an algorithm for the solution of multiobjective linear plus fractional programming problem (MOL+FPP) when some of the constraints are homogeneous in nature. Using homogeneous constraints, first we construct a transformation matrix T which transforms the given problem into another MOL+FPP with fewer constraints. Then, a relationship between these two problems, ensuring that the solu...
متن کامل